Improvable Knapsack Problems
نویسندگان
چکیده
We consider a variant of the knapsack problem, where items are available with different possible weights. Using a separate budget for these item improvements, the question is: Which items should be improved to which degree such that the resulting classic knapsack problem yields maximum profit? We present a detailed analysis for several cases of improvable knapsack problems, presenting constant factor approximation algorithms and two PTAS. Parts of this paper have been published in the extended conference abstract [GSSS14].
منابع مشابه
A dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملOnline Knapsack Problems
Since no competitive online algorithms exist for general knapsack problems, we consider online variants of knapsack problems with two assumptions: (i) the weight of each item is very small compared to the knapsack capacity; (ii) the value-to-weight ratio of each item is lower and upper bounded by two positive constants L and U . We design a deterministic threshold-based algorithm for the online...
متن کاملMOEA/D with Uniform Design for Solving Multiobjective Knapsack Problems
The 0/1 knapsack problem is a well-known problem, which appears in many real domains with practical importance. The problem is NP-complete. The multiobjective 0/1 knapsack problem is a generalization of the 0/1 knapsack problem in which multiple knapsacks are considered. Many algorithms have been proposed in the past five decades for both single and multiobjective knapsack problems. A new versi...
متن کاملA Robust Knapsack Based Constrained Portfolio Optimization
Many portfolio optimization problems deal with allocation of assets which carry a relatively high market price. Therefore, it is necessary to determine the integer value of assets when we deal with portfolio optimization. In addition, one of the main concerns with most portfolio optimization is associated with the type of constraints considered in different models. In many cases, the resulted p...
متن کاملGeneration Methods for Multidimensional Knapsack Problems and their Implications
Although there are a variety of heuristics developed and applied to the variants of the binary knapsack problem, the testing of these heuristics are based on poorly defined test problems. This paper reviews the various types of knapsack problems, considers how test problems have been generated and depicts via empirical results the implications of using poorly formed test problems for empirical ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1607.08338 شماره
صفحات -
تاریخ انتشار 2016